"Discrete Logarithm based 't, n' Threshold Group Signature Scheme"
نویسندگان
چکیده
منابع مشابه
A New Group Signature Scheme Based on the Discrete Logarithm
In 1998, Lee and Chang proposed an efficient group signature scheme based on the discrete logarithm. In the LeeChang scheme, when the signer has been identified, the authority has to redistribute the keys of this signer and send the keys to him/her. Otherwise, all the previous group signatures are linkable at the same time and any verifier will identify all future group signatures not through t...
متن کاملAn efficient blind signature scheme based on the elliptic curve discrete logarithm problem
Elliptic Curve Cryptosystems (ECC) have recently received significant attention by researchers due to their high performance such as low computational cost and small key size. In this paper a novel untraceable blind signature scheme is presented. Since the security of proposed method is based on difficulty of solving discrete logarithm over an elliptic curve, performance of the proposed scheme ...
متن کاملAn Efficient Signature Scheme based on Factoring and Discrete Logarithm
This paper proposes a new signature scheme based on two hard problems : the cube root extraction modulo a composite moduli (which is equivalent to the factorisation of the moduli, IFP) and the discrete logarithm problem(DLP). By combining these two cryptographic assumptions, we introduce an efficient and strongly secure signature scheme. We show that if an adversary can break the new scheme wit...
متن کاملNew digital signature scheme based on discrete logarithm - Electronics Letters
centrated around the edges. At a compression of 166:l (0.048biV pixel), the JPEG reconstruction (Fig. If, 26.33dB) gives a very blocky image. It is worth noting that the colours in the JPEG reconstruction (Fig. In are totally different from those in the original. This Letter has presented a very simple and effective adaptive image coding scheme which requires no training, no storage of codebook...
متن کاملCertificateless Signature Scheme Based on Rabin Algorithm and Discrete Logarithm
Certificateless signature is one of the most important security primitives which can be used to solve the key escrow problem existing in ID-based signature. The security of most certificateless signatures depends only based on one mathematical hard problem. This means that once the underlying hard problem is broken, the signature will be broken, too. In this paper, a certificateless signature w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2011
ISSN: 0975-8887
DOI: 10.5120/2483-3343